A Rigorous Proof on Circular Wirelength for Hypercubes

We study embeddings of the n-dimensional hypercube into circuit with 2n vertices. prove that circular wirelength attains a minimum by gray coding; was called CT conjecture Chavez and Trapp (Discrete Applied Mathematics, 1998). This problem had claimed to be settled Ching-Jung Guu in her doctoral dissertation “The for hypercubes” (University California, Riverside, 1997). Many argue there are gaps proof. eliminate dissertation.